Packing and covering constants for certain families of trees. I
نویسندگان
چکیده
In an earlier paper we considered the problem of determining the packing and covering constants for families of trees whose generating function^ satisfied a relation y = x(y) for some power series itiy. In the present paper we consider the problem for some families of trees whose generating functions satisfy a more complicated relation.
منابع مشابه
Packing and Covering by Translates of Certain Nonconvex Bodies
We develop techniques for determining the packing and covering constants for star bodies composed of cubes. In the theory of convex sets problems of tiling, packing, and covering by translates of a given set have a long history, with the main focus on the packing and covering by spheres. Only in a few cases is the densest packing or sparsest covering known, even in the case of the sphere, excep...
متن کاملEgerváry Research Group on Combinatorial Optimization Packing Arborescences Packing Arborescences
In [7], Edmonds proved a fundamental theorem on packing arborescences that has become the base of several subsequent extensions. Recently, Japanese researchers found an unexpected further generalization which gave rise to many interesting questions about this subject [29], [20]. Another line of researches focused on covering intersecting families which generalizes Edmonds' theorems in a di eren...
متن کاملPacking bounded-degree spanning graphs from separable families
Let G be a separable family of graphs. Then for all positive constants and ∆ and for every su ciently large integer n, every sequence G1, . . . , Gt ∈ G of graphs of order n and maximum degree at most ∆ such that e(G1)+· · ·+e(Gt) ≤ (1− ) ( n 2 ) packs into Kn. This improves results of Böttcher, Hladký, Piguet, and Taraz when G is the class of trees and of Messuti, Rödl, and Schacht in the case...
متن کاملPacking Arborescences
In [7], Edmonds proved a fundamental theorem on packing arborescences that has become the base of several subsequent extensions. Recently, Japanese researchers found an unexpected further generalization which gave rise to many interesting questions about this subject [29], [20]. Another line of researches focused on covering intersecting families which generalizes Edmonds' theorems in a di eren...
متن کاملON THE EDGE COVER POLYNOMIAL OF CERTAIN GRAPHS
Let $G$ be a simple graph of order $n$ and size $m$.The edge covering of $G$ is a set of edges such that every vertex of $G$ is incident to at least one edge of the set. The edge cover polynomial of $G$ is the polynomial$E(G,x)=sum_{i=rho(G)}^{m} e(G,i) x^{i}$,where $e(G,i)$ is the number of edge coverings of $G$ of size $i$, and$rho(G)$ is the edge covering number of $G$. In this paper we stud...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Graph Theory
دوره 1 شماره
صفحات -
تاریخ انتشار 1977